Logic programming with functions and predicates: The language Babel
نویسندگان
چکیده
منابع مشابه
Qualified Logic Programming with Bivalued Predicates
Research on the field of uncertainty in logic programming has evolved during the last 25 years. In a recent paper [13] we have revised a classical approach by van Emden’s to Quantitative Logic Programming [19], generalizing it to a generic scheme QLP(D) for so-called Qualified Logic Programming over a parametrically given domain D, whose elements play the role of generalized truth values and ca...
متن کاملThe completeness of logic programming with sort predicates
An order-sorted logic can be regarded as a generalized first-order predicate logic that includes many and ordered sorts (i.e. a sort-hierarchy). In the fields of knowledge representation and AI, this logic with sort-hierarchy has been used to design a logic-based language appropriate for representing taxonomic knowledge. By incorporating the sort-hierarchy, order-sorted resolution and sorted lo...
متن کاملImplementing Disequality in the Lazy Functional Logic Language Babel
x Abstract In this paper 1 , we investigate an implementation of a lazy functional logic language (in particular the language BABEL MR88,MR92]) which uses disequality constraints for solving equations and building answers. We specify a new operational semantics which combines lazy narrowing with disequality constraints and we deene an abstract machine tailored to the execution of BABEL programs...
متن کاملBabel: A Version Management System for the Java Programming Language
For the deployment of large software systems powerful mechanisms for module and version management are essential. For both areas, the popular Java programming language, however, provides only limited support. Module management is supported by means of Java’s package and jar file mechanisms which is mostly a packaging mechanism that just allows to amend packages in a jar file with some meta info...
متن کاملExtending Temporal Logic Programming with Choice Predicates Non-determinismy
In temporal logic programming, a stream can be speciied by a single-valued, time-varying predicate which, at any given moment in time, represents the corresponding element in the stream. However, due to inherent non-determinism in logic programming, time-varying predicates do not necessarily represent single-valued relations at any given moment in time. Choice predicates are also time-varying p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1992
ISSN: 0743-1066
DOI: 10.1016/0743-1066(92)90024-w